A DEEP IMPROVER OF TWO-MOVE CHESS MATE PROBLEMS

A Deep Improver of Two-move Chess Mate Problems

A Chess Composer of Two-Move Mate Problems

Computerized chess composers of mate problems are rare. Moreover, so far they do not produce either impressive or creative new mate problems. In this paper, we describe a model called CHESS COMPOSER. This model uses a 64-bit representation, an ordered version of Iterative-Deepening DepthFirst Search, and a quality function built with the help of two international masters in chess-problem compos...

An Improver of Chess Problems

Computer-chess programs achieve outstanding results at playing chess. However, no existing program can compose adequate chess problems. In this paper, we present a model that is capable of improving the quality of some of the existing chess problems. We have formalized a major part of the knowledge needed for evaluating the quality of chess problems. In the model, we attempt to improve a given ...

Comparing Move Choices of Chess Search Engines

Anecdotal evidence exists that in many positions two distinct chess engines will choose different moves and, moreover, that their top-n ranking of move choices also differ. Here we set out to quantify this difference, including the difference between move choices by chess engines and those made by humans. For our analysis we used FRITZ 8 and JUNIOR 9 as representative chess search engines and t...

Move similarity analysis in chess programs

In June 2011, the International Computer Games Association (ICGA) disqualified Vasik Rajlich and his Rybka chess program for plagiarism and breaking their rules on originality in their events from 2006-10. One primary basis for this came from a painstaking code comparison, using the source code of Fruit and the object code of Rybka, which found the selection of evaluation features in the progra...